Piotr Indyk

Results: 118



#Item
81References for the “Algorithmic High Dimensional Geometry” lectures at the Big Data Boot Camp, Simons Institute, Berkeley Alexandr Andoni Microsoft Research SVC September 4, 2013

References for the “Algorithmic High Dimensional Geometry” lectures at the Big Data Boot Camp, Simons Institute, Berkeley Alexandr Andoni Microsoft Research SVC September 4, 2013

Add to Reading List

Source URL: www.mit.edu

Language: English - Date: 2013-09-12 03:13:30
82Tutorial: Sparse Recovery Using Sparse Matrices Piotr Indyk MIT  Problem Formulation

Tutorial: Sparse Recovery Using Sparse Matrices Piotr Indyk MIT Problem Formulation

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2010-09-23 17:45:35
83Matrix multiplication and pattern matching under Hamming norm Rapha¨el Clifford January 23, 2009 Abstract My understanding of a conversation with Ely Porat who in turn attributes Piotr Indyk.

Matrix multiplication and pattern matching under Hamming norm Rapha¨el Clifford January 23, 2009 Abstract My understanding of a conversation with Ely Porat who in turn attributes Piotr Indyk.

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-03-11 07:07:10
84Sparse Recovery Using Sparse (Random) Matrices Piotr Indyk MIT Joint work with: Radu Berinde, Anna Gilbert, Howard Karloff, Martin Strauss and Milan Ruzic

Sparse Recovery Using Sparse (Random) Matrices Piotr Indyk MIT Joint work with: Radu Berinde, Anna Gilbert, Howard Karloff, Martin Strauss and Milan Ruzic

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2010-01-21 23:26:36
851  Introduction Gregory Shakhnarovich, Piotr Indyk, and Trevor Darrell  The nearest-neighbor (NN) problem occurs in the literature under many

1 Introduction Gregory Shakhnarovich, Piotr Indyk, and Trevor Darrell The nearest-neighbor (NN) problem occurs in the literature under many

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2006-03-03 12:41:25
86Sample-Optimal Fourier Sampling in Any Constant Dimension Piotr Indyk Michael Kapralov August 2, 2014

Sample-Optimal Fourier Sampling in Any Constant Dimension Piotr Indyk Michael Kapralov August 2, 2014

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2014-12-30 11:14:06
87Similarity Search in High Dimensions II Piotr Indyk MIT  Approximate Near(est) Neighbor

Similarity Search in High Dimensions II Piotr Indyk MIT Approximate Near(est) Neighbor

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2011-08-18 19:22:52
881  Sparse Recovery Using Sparse Matrices Anna Gilbert, Piotr Indyk  Abstract—We survey algorithms for sparse recovery problems that are based on sparse random matrices. Such matrices

1 Sparse Recovery Using Sparse Matrices Anna Gilbert, Piotr Indyk Abstract—We survey algorithms for sparse recovery problems that are based on sparse random matrices. Such matrices

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2010-05-15 17:43:14
89Sketching, streaming, and sub-linear space algorithms Piotr Indyk MIT (currently at Rice U)

Sketching, streaming, and sub-linear space algorithms Piotr Indyk MIT (currently at Rice U)

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2009-02-23 00:05:29
90Alexandr Andoni http://www.mit.edu/~andoni Email:  Phone: Experience

Alexandr Andoni http://www.mit.edu/~andoni Email: Phone: Experience

Add to Reading List

Source URL: www.mit.edu

Language: English - Date: 2015-02-05 02:44:09